Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming

MOTIVATION Logic modeling is a useful tool to study signal transduction across multiple pathways. Logic models can be generated by training a network containing the prior knowledge to phospho-proteomics data. The training can be performed using stochastic optimization procedures, but these are unable to guarantee a global optima or to report the complete family of feasible models. This, however...

متن کامل

Inductive Logic Programming in Answer Set Programming

In this paper we discuss the design of an Inductive Logic Programming system in Answer Set Programming and more in general the problem of integrating the two. We show how to formalise the learning problem as an ASP program and provide details on how the optimisation features of modern solvers can be adapted to derive preferred hypotheses.

متن کامل

Using Nested Logic Programs for Answer Set Programming

We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated to normal programs, which can be utilized to compute answer sets. The basic idea is to detect special subgraphs of those graphs corresponding to structural properties of normal programs and transform them into simpler ...

متن کامل

Answer set programming with default logic

We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP2 search problems.

متن کامل

Implementing Ordered Choice Logic Programming using Answer Set Solvers

Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This complete absence of negation does not weaken the language as both forms (classical and as-failure) can be intuitively simulated in the language and eliminated using a simple pre-processor, making it also an easy language for users...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bioinformatics

سال: 2013

ISSN: 1460-2059,1367-4803

DOI: 10.1093/bioinformatics/btt393